Planning in Belief Space with a Labelled Uncertainty Graph
نویسندگان
چکیده
Planning in belief space with a Labelled Uncertainty Graph, LUG, is an approach that uses a very compact planning graph to guide search in the space of belief states to construct conformant and contingent plans. A conformant plan is a plan that transitions (without sensing) all possible initial states through possibly non-deterministic actions to a goal state. A contingent plan adds the ability to observe state variables and branch execution. The LUG provides heuristics to guide a regression belief space planner, CAltAlt, and a progression belief space planner, PBSP . The key innovation of the LUG is to compactly represent the optimistic projection of several states (those in a belief state) within a single planning graph. Labels on the actions and literals denote the state projections that include them. We show the improvements of using a LUG by comparing it with a multiple planning graphs (one for each possible world) approach within CAltAlt. We also compare the approach to other conformant planners. Lastly, we outline an algorithm that can adapt the approach to stochastic planning.
منابع مشابه
Belief Space Reachability Heuristics for Conformant and Contingent Planning
Although reachability heuristics have been shown to be useful in conformant an contingent planning, the cost of heuristic computation is still an issue. We present several improvements of our previous work on planning graph heuristics for planning in belief space. One, we generalize our approach, based on using multiple planning graphs, to symbolically represent many planning graphs in a struct...
متن کاملPlanning Graph Heuristics for Incomplete and Non-Deterministic Domains
This doctoral work centers on developing domain-independent heuristics for planning problems characterized by state incompleteness and action non-determinism. The key means by which the heuristics are computed is through planning graph analysis. The approach has been used to construct conformant and contingent plans in two different search techniques. The initial focus of the research was inves...
متن کاملState agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of a set of states, and the naive technique enumerates the graphs individually. This is equivalent to solving an all-pairs shortest path problem by iterating a single-source algorithm over each source. We introduce a stru...
متن کاملFIRM : Sampling - based feedback motion planning under motion uncertainty and imperfect
In this paper we present feedback-based information roadmap (FIRM), a multi-query approach for planning under uncertainty which is a belief-space variant of probabilistic roadmap methods. The crucial feature of FIRM is that the costs associated with the edges are independent of each other, and in this sense it is the first method that generates a graph in belief space that preserves the optimal...
متن کامل3-difference cordial labeling of some cycle related graphs
Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge uv, assign the label |f(u) − f(v)|. The function f is called a k-difference cordial labeling of G if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004